Mutilated chessboard problem is exponentially hard for resolution
نویسندگان
چکیده
منابع مشابه
The Mutilated Chessboard Theorem in Z
This note presents a statement and proof of the mutilated chessboard theorem in Z. The formulation is along the lines of the one proposed by McCarthy for a ‘heavy duty set theory” theorem prover. The theorem and its proof are presented as a Z specification and a series of Z conjectures all of which have been mechanically verified using the ProofPower system. For the entertainment of the theorem...
متن کاملError estimation for indirect measurements is exponentially hard
For many physical quantities, it is impossible or too costly to measure them directly. In such cases, we measure whatever quantities x1, ..., xn we can, and then we use the measurement results x̃1, ..., x̃n to estimate the value of the desired quantity y. Namely, as an estimate, we use ỹ = f(x̃1, ..., x̃n), where an algorithm f describes how the value y is related to xi. This procedure is called an...
متن کاملReal Anaphora Resolution is Hard .
We introduce a system for anaphora resolution for German that uses various resources in order to develop a real system as opposed to systems based on idealized assumptions, e.g. the use of true mentions only or perfect parse trees and perfect morphology. The components that we use to replace such idealizations comprise a full-fledged morphology, a Wikipedia-based named entity recognition, a rul...
متن کاملPool resolution is NP-hard to recognize
A pool resolution proof is a dag-like resolution proof which admits a depth-first traversal tree in which no variable is used as a resolution variable twice on any branch. The problem of determining whether a given dag-like resolution proof is a valid pool resolution proof is shown to be NP-complete. Propositional resolution has been the foundational method for reasoning in propositional logic,...
متن کاملClique Is Hard on Average for Regular Resolution (Extended Abstract)
We prove that for k ≪ 4 √n regular resolution requires length nΩ(k ) to establish that an Erdős–Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in the exponent, and also implies unconditional nΩ(k ) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00395-5